Connectedness of Solution Sets for Weak Vector Variational Inequalities on Unbounded Closed Convex Sets
نویسندگان
چکیده
منابع مشابه
Connectedness of Solution Sets for Weak Vector Variational Inequalities on Unbounded Closed Convex Sets
and Applied Analysis 3 (ii) The scalar C-pseudomonotonicity in Definition 2 is weaker than C-pseudomonotonicity in Definition 1(ii). In fact, for any ξ ∈ C∗ \ {0}, x, y ∈ X, if ⟨ξ(u∗), y − x⟩ ≥ 0, then we have ⟨u∗, y − x⟩ ∉ − intC. Then, it follows from the Cpseudomonotonicity of T that ⟨V∗, y − x⟩ ∈ C, which implies that ⟨ξ(V∗), y − x⟩ ≥ 0. Definition 5. The topological space E is said to be c...
متن کاملFinite Illumination of Unbounded Closed Convex Sets
If K is an unbounded closed convex subset of Ed having nonempty interior, we seek necessary and/or sufficient conditions to ensure that the boundary of K can be externally illuminated from a finite set of directions. This problem was stated as open in a recent book by Boltyanski. The tools used in this search are those developed by Visibility Theory such as the ideas of star, inner stem, visibi...
متن کاملVariational Inequalities and Normals to Convex Sets
Variational inequalities and even quasi-variational inequalities, as means of expressing constrained equilibrium, have utilized geometric properties of convex sets, but the theory of tangent cones and normal cones has yet to be fully exploited. Much progress has been made in that theory in recent years in understanding the variational geometry of nonconvex as well as convex sets and applying it...
متن کاملHomotopy Methods for Solving Variational Inequalities in Unbounded Sets
In this paper, for solving the finite-dimensional variational inequality problem ðx x ÞFðx ÞP0; 8x 2 X; where F is a C ðr > 1Þ mapping from X to R, X 1⁄4 fx 2 R : gðxÞO0g is nonempty (not necessarily bounded) and gðxÞ :R ! R is a convex Crþ1 mapping, a homotopy method is presented. Under various conditions, existence and convergence of a smooth homotopy path from almost any interior initial poi...
متن کاملOn Unbounded Tolerable Solution Sets
We prove that the nonempty tolerable solution set of the interval linear system Ax = b is unbounded if and only if the interval matrix of the system has linearly dependent degenerate columns. Also, we prove that the tolerable solution set may be represented as a sum of the linear subspace {c R | Ac = 0} and a bounded convex polyhedron and propose a way for suitable estimation of unbounded tol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Abstract and Applied Analysis
سال: 2013
ISSN: 1085-3375,1687-0409
DOI: 10.1155/2013/431717